6.896 Topics in Algorithmic Game Theory February 10, 2010 Lecture 3
نویسندگان
چکیده
In the previous lecture we saw that there always exists a Nash equilibrium in two-player zero-sum games. Moreover, the equilibrium enjoys several attractive properties such as polynomial-time tractability, convexity of the equilibrium set, and uniqueness of players’ payoffs in all equilibria. In the present and the following lecture we investigate whether simple and natural distributed protocols can find the value/equilibrium strategies of a zero-sum game. We have in mind very generic settings in which the players may be oblivious to the exact specifications of the zero-sum game they are playing. We only require that they know what strategies are available to them, and can observe how well each of their strategies performs against the choices of their opponent.
منابع مشابه
6.896 Topics in Algorithmic Game Theory February 8, 2010 Lecture 2
Two-Player (Normal-Form) Games. A two-player normal-form game is specified via a pair (R,C) of m × n payoff matrices. The two players of the game, called the row player and the column player, have respectively m and n pure strategies. As the players’ names imply, the pure strategies of the row player are in one-to-one correspondence with the rows of the payoff matrices, while the strategies of ...
متن کامل6.896 Topics in Algorithmic Game Theory March 1, 2010 Lecture 8
The complexity class PPAD (“Polynomial Parity Argument on Directed Graphs”) was proposed by Christos Papadimitriou in 1994 [6]. Its goal is to capture the complexity of searching for an object whose existence is guaranteed by the principle that, “A directed graph with an unbalanced node (indegree 6= outdegree) must have another unbalanced node.” Suppose that we describe an exponentially large g...
متن کاملLectures on Frugal Mechanism Design
These lecture notes cover two lectures from EECS 510, Algorithmic Mechanism Design, offered at Northwestern University in the Spring 2008 term. They cover the topic of frugality in mechanism design. Prerequisites for reading these lecture notes are basic understanding of algorithms and complexity as well as elementary calculus and probability theory. I will also assume that the reader has acces...
متن کاملCMSC 858 F : Algorithmic Game Theory Fall 2010 Market Clearing with Applications
We will look at MARKET CLEARING or MARKET EQUILIBRIUM prices. We will consider two models with linear utilities : FISHER model and ARROWDEBREU model. See [1] and chapter 5 of [2] for more details. Finally we see an application of the FISHER model to wireless networks. I have also used as reference the scribe notes for this same lecture when this course was taught by Prof. Hajiaghayi at Rutgers ...
متن کاملAdvanced Topics in Machine Learning and Algorithmic Game Theory Fall semester , 2011 / 12 Lecture 10 : Market Equilibrium
Today topic is market equilibrium. The basic elements of a market are buyers and product (and there are also potentially sellers). The goal is to nd prices that clear the market. Namely, under those prices every product is completely sold, and there is no remaining demand. In other words, we would like to achieve a state where demand equals supply. This is probably one of the most important con...
متن کامل